Wireless sensor networks (WSNs) suffers from the hot spot problem where the sensor nodes closest to the base station are need to relay more packet than the nodes farther away from the base station. Thus, lifetime of sensory network depends on these closest nodes. Clustering methods are used to extend the lifetime of a wireless sensor network. However, current clustering algorithms usually utili...

Wireless sensor networks (WSNs) suffers from the hot spot problem where the sensor nodes closest to the base station are need to relay more packet than the nodes farther away from the base station. Thus, lifetime of sensory network depends on these closest nodes. Clustering methods are used to extend the lifetime of a wireless sensor network. However, current clustering algorithms usually utili...

Wireless sensor network used Clustering techniques to extend the lifetime of the network. LEACH is the one from these clustering techniques to maintain the energy efficiency of sensors. The technique of selecting nodes with highest residual energy as cluster heads with the assumption that energy consumption distribute periodically between the nodes. Cluster heads collect information from the su...

Wireless sensor network used Clustering techniques to extend the lifetime of the network. LEACH is the one from these clustering techniques to maintain the energy efficiency of sensors. The technique of selecting nodes with highest residual energy as cluster heads with the assumption that energy consumption distribute periodically between the nodes. Cluster heads collect information from the su...

Wireless sensor networks faces unbalanced energy consumption problem over time. Clustering provides an energy efficient method to improve lifespan of the sensor network. Cluster head collects data from other nodes and transmits it towards the sink node. Cluster heads which are far-off from the sink, consumes more power in transmission of information towards the sink. We propose Region Based Ene...

The Minimum Dominating Set (MDS) problem is to find a minimum such S for a given network graph. It is the fundamental math problem underlying routing: construct “cluster heads” in the network graph so you can rapidly, hierarchically, send messages from one cluster to another, and the cluster heads will oversee routing within and through the individual cluster. Of course, the members of S are th...

Most of the clustering algorithms utilize two techniques which are selecting cluster-heads with more residual energy and rotating cluster-heads periodically to balance energy consumption of the sensor nodes over the network . These clustering algorithms do not take the location of the base station into consideration. This lack of consideration causes the hot spots problem in multi-hop wireless ...

As a classic clustering algorithm, LEACH is widely used in wireless sensor networks. Due to the random cluster head selection process, LEACH does not guarantee optimization for the number and position of cluster heads. In order to further optimize LEACH, an optimal energyefficient cluster-heads selection algorithm LEACH-G for LEACH protocol is presented. We calculate the optimal number of clust...

Abstract—Wide research has been carried out in this Wireless Sensor Networks to improve the lifetime of the sensor nodes in order to enhance the performance of the network. Clustering h reduces the energy consumption of each node, but it increases the communication burden of the cluster heads. In the proposed intra-cluster and inter-cluster traffic are used to reduce the load of the cluster hea...

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this ...